Graph-wreath products and finiteness conditionsI

On Finite Generation and Other Finiteness Conditions for Wreath Products of Semigroups

On the Absence of Cohomological Finiteness in Wreath Products

The wreath product W = A i T, where A ^ 1, is of type FP2 if and only if T is finite and A is of type FP2. 1991 Mathematics subject classification (Amer. Math. Soc): primary 20E22, 20F05, 20J05.

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

Intersection graphs associated with semigroup acts

The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...

Efficient domination in circulant graphs

Results about wreath products of circulant graphs are used to construct infinitely many circulant graphswith efficient dominating setswhose elements need not be equally spaced in Zn. It is proved that if a circulant graph of large degree has an efficient dominating set, then either its elements are equally spaced, or the graph is the wreath product of a smaller circulant graph with an efficient...